Search and Matching Models in Microeconomics
نویسندگان
چکیده
منابع مشابه
Improved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملImproved Skips for Faster Postings List Intersection
Information retrieval can be achieved through computerized processes by generating a list of relevant responses to a query. The document processor, matching function and query analyzer are the main components of an information retrieval system. Document retrieval system is fundamentally based on: Boolean, vector-space, probabilistic, and language models. In this paper, a new methodology for mat...
متن کاملبررسی مدل ذهنی دانشجویان کارشناسی ارشد نسبت به موتور کاوش گوگل
The World Wide Web (WWW) is a major channel of getting information and using web search engines is the most popular way of accessing information. This study aims to investigate master students’ mental model completeness level of Google web search engine. From the methodological perspective, this research is a practical one based on survey method. The sample population consisted of 30 master stu...
متن کاملQualitative Mismatches
Qualitative mismatches arise when the qualifications of workers, individually or in the aggregate, are different from the qualifications required or specified for their jobs. This study reviews the literature on qualitative mismatches, including overeducation, job mobility and shifts in demands and supplies of workers, and relates it to ongoing phenomena such as search and matching models of un...
متن کاملOn the inverse maximum perfect matching problem under the bottleneck-type Hamming distance
Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015